Description: 旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。
-Traveling Salesman Problem, or TSP problem (Travelling Salesman Problem) is a well-known field of mathematics problems. Assuming there is a travel business to visit n cities, he must choose which path to go, via the restriction is to visit each city only once and the last to go back to the original departure city. Path selection objective is to get the path distance for all paths are the minimum. Platform: |
Size: 1231872 |
Author:吴昆 |
Hits:
Description: 对于组合数学中旅行商问题，即从某一点出发，中间经过多个互不相通的节点，最后返回原点。程序给出了具体实现。-For the traveling salesman problem in combinatorial mathematics, that is, from a point of departure, each pass through a number of middle nodes, and finally return to the starting point. Procedures are given concrete realization. Platform: |
Size: 164864 |
Author:王海涛 |
Hits:
Description: 旅行商问题_数组实现
请设计出一个动态规划算法
程序设计
任给一个输入实例，能输出最短路程及其路线
能用图形演示旅行商的推销路线-Traveling Salesman Problem _ array to achieve, please design a dynamic programming algorithm to a program design any input example, can output the shortest distance and routes can be used to sell graphical presentation of the traveling salesman route Platform: |
Size: 116736 |
Author:战天 |
Hits:
Description: 遗传算法解中国旅行商问题，里面有45个城市，用遗传算法算出近似最优解-Genetic Algorithm for Traveling Salesman Problem in China, there are 45 cities, using genetic algorithms calculate the approximate optimal solution Platform: |
Size: 520192 |
Author:lsk |
Hits:
Description: (1).问题描述：旅行商问题
某售货员要到若干城市去推销商品，已知各城市之间的路程（或旅费）。他要
选定一条从驻地出发，经过每个城市一遍，最后回到驻地的路线，使总的路程（
或旅费）最小。
(2).程序设计要求：
a. 设计一个动态规划算法
b. 任给一个输入实例，能输出最短路程及其路线
c. 能用图形演示旅行商的推销路线
输入要测试的文件名，如TSP6.txt,程序将利用动态规划求解该问题，给出最佳线
路，并用图形演示。-(1). Problem Description: A salesman traveling salesman problem to a number of cities to sell commodities, known distance between cities (or travel). He has to select a departure from the resident, through every city once again, and finally returned to the resident s line, bringing the total distance (or travel) the smallest. (2). Program design requirements: a. the design of a dynamic programming algorithm to an input b. any examples, can output the shortest distance and the line c. use graphical presentation of the traveling salesman selling line of input to test the file name, such as TSP6 . txt, the procedure will use dynamic programming to solve the problem, given the best lines, and graphics presentation. Platform: |
Size: 10240 |
Author:小明 |
Hits:
Description: 这个是最基本的使用MATLAB平台,来解决旅行商的问题,可以较好的运用matlanb来解决类似TSP的问题-This is the most basic platform for the use of MATLAB to solve the traveling salesman problems, they can better use matlanb similar to TSP to solve the problem of Platform: |
Size: 3072 |
Author:lady |
Hits:
Description: 此源代码是用遗传算法解决旅行商问题的经典实例，很有借鉴意义-This source code is a genetic algorithm to solve the classic traveling salesman problem instances of referential significance to Platform: |
Size: 4096 |
Author:张媛 |
Hits:
Description: TSP问题的动态规划求解。问题描述：旅行商问题，即TSP问题（Travelling Salesman Problem）是数学领域中著名问题之一。假设有一个旅行商人要拜访n个城市，他必须选择所要走的路径，路经的限制是每个城市只能拜访一次，而且最后要回到原来出发的城市。路径的选择目标是要求得的路径路程为所有路径之中的最小值。 -TSP dynamic programming to solve the problem. Description of the problem: traveling salesman problem, namely TSP problem (Travelling Salesman Problem) is a well-known field of mathematics problems. Assuming there is a travel businessmen to visit n cities, he must choose which path to go, via the restriction is to visit each city only once and the last to go back to the original departure city. Path selection objective is to get the path distance for all paths are the minimum. Platform: |
Size: 1045504 |
Author:黄艺敏 |
Hits:
Description: 解决旅行商问题的C++代码，可以欣赏以下-Solve the Traveling Salesman Problem C++ Code, you can enjoy the following Platform: |
Size: 3072 |
Author:有偿编程，挣点生活费 |
Hits:
Description: lingo 多旅行商问题的求解代码
每人限制运货为50-multi-lingo code for solving the traveling salesman problem restricted shipments of 50 per person Platform: |
Size: 1024 |
Author:phoebe |
Hits:
Description: 这是一个MATLAB写的一个解决TSP问题的蚁群算法程序。-This is a MATLAB to write a solution to the problem of ant colony algorithm TSP procedures. Platform: |
Size: 3072 |
Author:leijiang |
Hits:
Description: 用遗传算法解决旅行商问题，有详细的注释 -Genetic algorithm is used to solve the traveling salesman problem, there are detailed notes Platform: |
Size: 118784 |
Author:ljc |
Hits:
Description: 该算法经运行，无任何问题，可用于解决遗传算法求解旅行商问题-The algorithm by running without any problems, can be used to solve the traveling salesman problem genetic algorithm Platform: |
Size: 5120 |
Author:赵赵 |
Hits:
Description: Daniel K.Rosenkrantz. Richard E.Stearns. 关于旅行商问题的集中启发式算法的分析-Daniel K. Rosenkrantz. Richard E. Stearns. The focus on the traveling salesman problem heuristics analysis Platform: |
Size: 1915904 |
Author:phil |
Hits:
Description: 旅行商（TSP）问题一直以来都是一个NP难问题，旅行商问题（TSP问题）就是一销售商从n个城市中的某一城市出发，不重复地走完其余n-1个城市并回到原出发点，在所有可能的路径中求出路径长度最短的一条。本次软件设计是利用模拟退火算法解决TSP问题，通过该软件设计，对模拟退火算法和旅行商问题有个初步的认识。-Traveling Salesman (TSP) problem has always been a NP hard problem, traveling salesman problem (TSP problem) is a vendor from the n cities in a city of departure, not repeated through the remaining n-1 cities and back to to the original starting point, in all possible path to derive a shortest path length. The software design is the use of simulated annealing algorithm to solve TSP problems, the adoption of the software design, on the simulated annealing algorithm and the traveling salesman problem to have a preliminary understanding. Platform: |
Size: 1024 |
Author:周薇 |
Hits:
Description: 在大学生或者研究生数学建模竞赛中旅行商优化问题是一个很重要而又难解决的问题，本人自编程蚁群算法智能程序很好的解决此问题。-University students or graduate students in the Mathematical Contest in Modeling in the traveling salesman optimization problem is a very important and difficult to resolve the problem, I self-programming smart procedures ant colony algorithm to solve this problem very well. Platform: |
Size: 2048 |
Author:gjj |
Hits:
Description: 用模拟退火算法对求解旅行商组合优化问题作了一定的研究，提出了多种不同的随机抽样方式，并对其进行了分析计算并以代码实现。
-This paper studied the optimizing of the traveling salesman problem with the Simulated Annealing(SA)．
Different random sampling forms were proposed and analyzed．
Platform: |
Size: 7827456 |
Author:裴 |
Hits:
Search - the traveling salesman